Martin-Löf random generalized Poisson processes
نویسنده
چکیده
Martin-Löf randomness was originally defined and studied in the context of the Cantor space 2ω . In [1] probability theoretic random closed sets (RACS) are used as the foundation for the study of Martin-Löf randomness in spaces of closed sets. Here we focus on the space of closed subsets of R and a particular family of measures on this space, the generalized Poisson processes. This gives a novel class of Martin-Löf random closed subsets of R. We begin studying these Martin-Löf random closed sets, proving in part that the elements of these sets are themselves Martin-Löf random.
منابع مشابه
Algorithmically random closed sets and probability
by Logan M. Axon Algorithmic randomness in the Cantor space, 2 ω , has recently become the subject of intense study. Originally defined in terms of the fair coin measure, algorithmic randomness has since been extended, for example in Reimann and Slaman [22, 23], to more general measures. Others have meanwhile developed definitions of algorithmic randomness for different spaces, for example the ...
متن کاملMartin-Löf randomness and Galton-Watson processes
The members of Martin-Löf random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-Löf random Galton–Watson trees with survival parameter 2 3 . To be such a member, a sufficient condition is to have effective Hausdorff dimension strictly greater than γ = log2 3 2 , and a necessary condition is to have effective Hausdorff dimension greate...
متن کاملNon-cupping and Randomness
Let Y ∈ ∆2 be Martin-Löf-random. Then there is a promptly simple set A such that for each Martin-Löf-random set Z, Y ≤T A ⊕ Z ⇒ Y ≤T Z. When Y = Ω, one obtains a c.e. non-computable set A which is not weakly Martin-Löf cuppable. That is, for any Martin-Löf-random set Z, if ∅′ ≤T A⊕ Z, then ∅′ ≤T Z.
متن کاملRelative Randomness and Cardinality
A set B ⊆ N is called low for Martin-Löf random if every Martin-Löf random set is also Martin-Löf random relative to B. We show that a ∆2 set B is low for Martin-Löf random iff the class of oracles which compress less efficiently than B, namely the class C = {A | ∀n K(n) ≤ K(n)} is countable (where K denotes the prefix free complexity and ≤ denotes inequality modulo a constant). It follows that...
متن کاملOn zeros of Martin-Löf random Brownian motion
We investigate the sample path properties of Martin-Löf random Brownian motion. We show (1) that many classical results which are known to hold almost surely hold for every Martin-Löf random Brownian path, (2) that the effective dimension of zeroes of a Martin-Löf random Brownian path must be at least 1/2, and conversely that every real with effective dimension greater than 1/2 must be a zero o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 169 شماره
صفحات -
تاریخ انتشار 2018